Noncommutative Partial Convexity Via $$\Gamma $$-Convexity

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Noncommutative Convexity in C ∗ - Bimodules

Let A and B be C∗-algebras. We consider a noncommutative convexity in Hilbert A -B-bimodules, called A -B-convexity, as a generalization of C∗-convexity in C∗-algebras. We show that if X is a Hilbert A -B-bimodule, then Mn(X ) is a Hilbert Mn(A )-Mn(B)-bimodule and apply it to show that the closed unit ball of every Hilbert A -B-bimodule is A -B-convex. Some properties of this kind of convexity...

متن کامل

Non-commutative Partial Matrix Convexity

Let p be a polynomial in the non-commuting variables (a, x) = (a1, . . . , aga , x1, . . . , xgx). If p is convex in the variables x, then p has degree two in x and moreover, p has the form p = L + ΛΛ, where L has degree at most one in x and Λ is a (column) vector which is linear in x, so that ΛΛ is a both sum of squares and homogeneous of degree two. Of course the converse is true also. Furthe...

متن کامل

Near convexity, metric convexity, and convexity

It is shown that a subset of a uniformly convex normed space is nearly convex if and only if its closure is convex. Also, a normed space satisfying a mild completeness property is strictly convex if and only if every metrically convex subset is convex. 1 Classical and constructive mathematics The arguments in this paper conform to constructive mathematics in the sense of Errett Bishop. This mea...

متن کامل

Measuring Convexity via Convex Polygons

This paper describes a general approach to compute a family of convexity measures. Inspired by the use of geometric primitives (such as circles) which are often fitted to shapes to approximate them, we use convex polygons for this task. Convex polygons can be generated in many ways, and several are demonstrated here. These polygons are scaled and translated to ensure that they fit the input sha...

متن کامل

Tropical Convexity via Cellular Resolutions

The tropical convex hull of a finite set of points in tropical projective space has a natural structure of a cellular free resolution. Therefore, methods from computational commutative algebra can be used to compute tropical convex hulls. This approach is computationally competitive with combinatorial methods. Tropical cyclic polytopes are also presented.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Journal of Geometric Analysis

سال: 2020

ISSN: 1050-6926,1559-002X

DOI: 10.1007/s12220-020-00387-1